Random Walks on Discrete and Continuous
نویسنده
چکیده
We consider a large class of random walks on the discrete circle Z=(n), deened in terms of a piecewise Lipschitz function, and motivated by the \generation gap" process of Diaconis. For such walks, we show that the time until convergence to stationarity is bounded independently of n. Our techniques involve Fourier analysis and a comparison of the random walks on Z=(n) with a random walk on the continuous circle S 1 .
منابع مشابه
Discrete-time random walks on diagrams (graphs) with cycles.
After a review of the diagram method for continuous-time random walks on graphs with cycles, the method is extended to discrete-time random walks. The basic theorems carry over formally from continuous time to discrete time. Three problems in tennis probabilities are used to illustrate random walks on discrete-time diagrams with cycles.
متن کاملRandom Walks on Discrete and Continuous Circles
We consider a large class of random walks on the discrete circle Z/(n), defined in terms of a piecewise Lipschitz function, and motivated by the “generation gap” process of Diaconis. For such walks, we show that the time until convergence to stationarity is bounded independently of n. Our techniques involve Fourier analysis and a comparison of the random walks on Z/(n) with a random walk on the...
متن کاملRefined estimates for some basic random walks on the symmetric and alternating groups
We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups Sn and An. We consider the following models: random transposition, transpose top with random, random insertion, and walks generated by the uniform measure on a conjugacy class. In the case of random walks on Sn and An generated by the uniform measure on...
متن کاملQuantum Walks
Quantum walks can be considered as a generalized version of the classical random walk. There are two classes of quantum walks, that is, the discrete-time (or coined) and the continuous-time quantum walks. This manuscript treats the discrete case in Part I and continuous case in Part II, respectively. Most of the contents are based on our results. Furthermore, papers on quantum walks are listed ...
متن کاملOn the relationship between continuous- and discrete-time quantum walk
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or discrete time. But whereas a continuous-time random walk can be obtained as the limit of a sequence of discretetime random walks, the two types of quantum w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994